More on sparse representations in arbitrary bases
نویسندگان
چکیده
منابع مشابه
More on Sparse Representations in Arbitrary Bases
The purpose of this contribution is to generalize some recent results on sparse representations of signals in redundant bases. The question that is considered is the following : let A be a known (n, m) matrix with m > n, one observes b = AX where X is known to have p < n nonzero components, under which conditions on A and p is it possible to recover X by solving a convex optimization problem su...
متن کاملSparse representations in unions of bases
The purpose of this correspondence is to generalize a result by Donoho and Huo and Elad and Bruckstein on sparse representations of signals in a union of two orthonormal bases for . We consider general (redundant) dictionaries for , and derive sufficient conditions for having uniquesparserepresentations of signals insuchdictionaries.Thespecial case where the dictionary is given by the union of ...
متن کاملComputing Sparse Representations of Multidimensional Signals Using Kronecker Bases
Recently there has been great interest in sparse representations of signals under the assumption that signals (data sets) can be well approximated by a linear combination of few elements of a known basis (dictionary). Many algorithms have been developed to find such representations for one-dimensional signals (vectors), which requires finding the sparsest solution of an underdetermined linear s...
متن کاملOn Binomial Identities in Arbitrary Bases
We first extend the digital binomial identity as given by Nguyen et al. to an identity in an arbitrary base b, by introducing the b-ary binomial coefficients. Then, we study the properties of these coefficients such as their orthogonality, their link with Lucas’ theorem and their extension to multinomial coefficients. Finally, we analyze the structure of the corresponding b-ary Pascal-like tria...
متن کاملOn Sparse Evaluation Representations
The Sparse Evaluation Graph has emerged over the past several years as an intermediate representation that captures the data ow information in a program compactly and helps perform data ow analysis e ciently. The contributions of this paper1 are three-fold: We present a linear time algorithm for constructing a variant of the Sparse Evaluation Graph for any data ow analysis problem. Our algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2003
ISSN: 1474-6670
DOI: 10.1016/s1474-6670(17)34942-x